The Complexity of Checking Redundancy of CNF Propositional Formulae
نویسنده
چکیده
A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleting some of its clauses: what results is an irredundant equivalent subset (I.E.S.) We study the complexity of some related problems: verification, checking existence of a I.E.S. with a given size, checking necessary and possible presence of clauses in I.E.S.’s, and uniqueness.
منابع مشابه
Redundancy in Logic I: CNF Propositional Formulae
A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleting some of its clauses: what results is an irredundant equivalent subset (I.E.S.) We study the co...
متن کاملRedundancy in Logic II: 2CNF and Horn Propositional Formulae
We report complexity results about redundancy of formulae in 2CNF form. We first consider the problem of checking redundancy and show some algorithms that are slightly better than the trivial one. We then analyze problems related to finding irredundant equivalent subsets (i.e.s.) of a given set. The concept of cyclicity proved to be relevant to the complexity of these problems. Some results abo...
متن کاملTemporal logic encodings for SAT-based bounded model checking
Since its introduction in 1999, bounded model checking (BMC) has quickly become a serious and indispensable tool for the formal verification of hardware designs and, more recently, software. By leveraging propositional satisfiability (SAT) solvers, BMC overcomes some of the shortcomings of more conventional model checking methods. In model checking we automatically verify whether a state transi...
متن کاملMining to Compact CNF Propositional Formulae
In this paper, we propose a first application of data mining techniques to propositional satisfiability. Our proposed Mining4SAT approach aims to discover and to exploit hidden structural knowledge for reducing the size of propositional formulae in conjunctive normal form (CNF). Mining4SAT combines both frequent itemset mining techniques and Tseitin’s encoding for a compact representation of CN...
متن کاملGenerating Simpler CNF Formulae for SAT-Based LTL Model Checking
Since its introduction, Bounded Model Checking has been a motivating factor for the development of SAT solvers and considerable research has been directed towards them. However, while great advances have been made, other factors determining the overall runtime of the model-checking process have been afforded less attention. The process by which the CNF representation is obtained has a major eff...
متن کامل